ACTIVE-A Real Time Commit Protocol
نویسندگان
چکیده
Many existing real time commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from sending WORKDONE/PREPARED message and restrict them from lending data so that transaction abort chain is limited to one. Thus, transaction execution time increases. This paper proposes a modified real time commit protocol for distributed real time database systems (DRTDBS), Allow Commit Dependent and in Time borrowers for Incredible Value added data lending without extended abort chain (ACTIVE), where borrower cohorts are categorized as commit and abort dependent. Further, the commit dependent borrowers can lend data to executing cohorts with still limiting the transaction abort chain to one only and reducing the data inaccessibility. Also, an incoming executing cohort having borrowing factor greater than one can only borrow the dirty data items from lender. This minimizes the fruitless borrowing by the cohort. The performance of ACTIVE is compared with PROMPT, 2SC and SWIFT protocols for both main memory resident and disk resident databases with and without communication delay. Simulation results show that the proposed protocol improves the system performance up to 4% as transaction miss percentage.
منابع مشابه
In Search for an E cient Real - Time Atomic Commit Protocol
The purpose of this paper is to report on the rst step in our quest for an e cient atomic commit protocol in real time databases This includes the development of real time implicit yes vote RT IYV a new real time atomic commit protocol In contrast to other real time commit protocols that provide for semantic atomicity RT IYV is designed to ensure the traditional notion of transaction atomicity ...
متن کاملCommit Processing in Distributed Real-Time Database Systems - Real-Time Systems Symposium, 1996., 17th IEEE
W e investigate here the performance implications of supporting transaction atomicity in a distributed realtime database system. Using a detailed simulation model of a firm-deadline distributed real-time database sgstem, we profile the real-time performance of a representative set of commit protocols. A new commit protocol that i s designed for the real-time domain and allows transactions to “o...
متن کاملar X iv : 1 20 1 . 34 16 v 1 [ cs . S E ] 1 7 Ja n 20 12 Verifying Real - time Commit Protocols Using Dense - time Model Checking Technology ⋆
The timed-based automata model, introduced by Alur and Dill, provides a useful formalism for describing real-time systems. Over the last two decades, several dense-time model checking tools have been developed based on that model. The paper considers the verification of real-time distributed commit protocols using dense-time model checking technology. More precisely, we model and verify the wel...
متن کاملVerifying Real-time Commit Protocols Using Dense-time Model Checking Technology
The timed-based automata model, introduced by Alur and Dill, provides a useful formalism for describing real-time systems. Over the last two decades, several dense-time model checking tools have been developed based on that model. The paper considers the verification of real-time distributed commit protocols using dense-time model checking technology. More precisely, we model and verify the wel...
متن کاملCommit processing in distributed real-time database systems
Incorporating distributed data into the real-time framework incurs the well-known additional complexities that are associated with transaction concurrency control and database recovery in distributed database systems. We investigate here the performance implications of supporting transaction atomicity in a distributed real-time database system. Using a detailed simulation model of a rm-deadline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Wireless Sensor Network
دوره 2 شماره
صفحات -
تاریخ انتشار 2010